package leetcode.D1000.T934;

import util.GraphUtil;

public class M934 {
    public static void main(String[] args) {
        int[][] A = GraphUtil.parseGraph("[[0,1,0,0,0,0],[0,1,1,1,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[1,1,0,0,0,0]]");
        GraphUtil.printGraph(A);
        System.out.println("===========================");
        System.out.println(new Solution().shortestBridge(A));
        GraphUtil.printGraph(A);
    }
}
